A domain model characterising strong normalisation

نویسنده

  • Ulrich Berger
چکیده

Building on previous work by Coquand and Spiwack [8] we construct a strict domaintheoretic model for the untyped λ-calculus with pattern matching and term rewriting which has the property that a term is strongly normalising if its value is not ⊥. There are no disjointness or confluence conditions imposed on the rewrite rules, and under a mild but necessary condition completeness of the method is proven. As an application, we prove strong normalisation for barrecursion in higher types combined with polymorphism and non-deterministic choice.

متن کامل
منابع مشابه

A Behavioural Model for Klop's Calculus

A model characterising strong normalisation for Klop’s extension of λ-calculus is presented. The main technical tools for this result are an inductive definition of strongly normalising terms of Klop’s calculus and an intersection type system for terms of Klop’s calculus.

متن کامل

Continuous semantics for strong normalisation

We prove a general strong normalisation theorem for higher type rewrite systems based on Tait's strong computability predicates and a strictly continuous domain-theoretic semantics. The theorem applies to extensions of Gödel's system T , but also to various forms of barrecursion for which strong normalisation was hitherto unknown.

متن کامل

Autistic adults show preserved normalisation of sensory responses in gaze processing

Progress in our understanding of autism spectrum disorder (ASD) has recently been sought by characterising how systematic differences in canonical neural computations employed across the sensory cortex might contribute to clinical symptoms in diverse sensory, cognitive, and social domains. A key proposal is that ASD is characterised by reduced divisive normalisation of sensory responses. This p...

متن کامل

Strong Normalisation for Applied Lambda Calculi

We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting ⊥ is strongly normalising provided all its ‘stratified approximations’ are. From this we derive a general normalisation theorem for applied typed λ-calculi: If all constants have a total value, then all typeable terms are strongly nor...

متن کامل

Characterising Strong Normalisation for Explicit Substitutions

We characterise the strongly normalising terms of a composition-free calculus of explicit substititions (with or without garbage collection) by means of an intersection type assignment system. The main novelty is a new cut-rule which allows to forget the context of the minor premise when the context of the main premise does not have an assumption for the cut variable.

متن کامل

ذخیره در منابع من

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:
  • Ann. Pure Appl. Logic

دوره 156  شماره 

صفحات  -

تاریخ انتشار 2008